package Day2025_02_22;

public class LeetCode162 {
    public int findPeakElement(int[] arr) {
        int n = arr.length;
        int left = 0, right = n - 1;
        while (left < right) {
            int mid = left + (right - left + 1) / 2;
            if (arr[mid] <= arr[mid - 1]) right = mid - 1;
            else left = mid;
        }
        return left;
    }
}
